Improved average complexity for comparison-based sorting
نویسندگان
چکیده
منابع مشابه
Improved Average Complexity for Comparison-Based Sorting
This paper studies the average complexity on the number of comparisons for sorting algorithms. Its information-theoretic lower bound is n lg n− 1.4427n+O(log n). For many efficient algorithms, the first n lg n term is easy to achieve and our focus is on the (negative) constant factor of the linear term. The current best value is −1.3999 for the MergeInsertion sort. Our new value is −1.4106, nar...
متن کاملLinear Complexity Assertions for Sorting
AbstructCorrectness of the execution of sorting programs can be checked by two assertions: the order assertion and the permutation assertion. The order assertion checks if the sorted data is in ascending or descending order. The permutation assertion checks if the output data produced by sorting is a permutation of the original input data. Permutation and order assertions are sufficient for the...
متن کاملTight Comparison Bounds on the Complexity of Parallel Sorting
The problem of sorting n elements using p processors in a parallel comparison model is considered. Lower and upper bounds which imply that for p ≥ n, the time complexity of this problem is Θ( log( 1 + p / n) logn _ __________ ) are presented. This complements [AKS-83] in settling the problem since the AKS sorting network established that for p≤n the time complexity is Θ( p nlogn _ _____ ). To p...
متن کاملAverage Biased ReLU Based CNN Descriptor for Improved Face Retrieval
The convolutional neural networks (CNN) like AlexNet, GoogleNet, VGGNet, etc. have been proven as the very discriminative feature descriptor for many computer vision problems. The trained CNN model over one dataset performs reasonably well over another dataset of similar type and outperforms the hand-designed feature descriptor. The Rectified Linear Unit (ReLU) layer discards some information i...
متن کاملAverage Circuit Depth and Average Communication Complexity
We use the techniques of Karchmer and Widgerson KW90] to derive strong lower bounds on the expected parallel time to compute boolean functions by circuits. By average time, we mean the time needed on a self-timed circuit, a model introduced recently by Jakoby, Reischuk, and Schindelhauer, JRS94] in which gates compute their output as soon as it is determined (possibly by a subset of the inputs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.06.032